A hierarchical graph matching method to assess accuracy of network extraction from DTM
نویسنده
چکیده
More and more elevation data and methods are available to automatically map hydrographic or thalweg networks. However, there are few methods to assess the network quality. The most used method to compare an extracted network to a reference network gives global quality information on only geographic criterion. The method proposed in this paper allows a network assessment compared to a reference network whose results can be interpreted more easily and more related to networks morphologies. This method is based on a hierarchical node matching within a graph. Nodes are classified by hierarchical level according to their importance in the tree-structured network. Then, a matching process seeks for nodes pairs between the two networks based on the geographic distance. The hierarchy introduces a priority order in the matching. The relative location of nodes pairs is checked in order to ensure a topological consistency. Finally, similarity statistics based on nodes matching counts are computed. While the usual method only takes into account a geographic criterion, the presented method integrates geographic, geometric and topologic criteria. It is an interactive and object-byobject matching. Moreover, the hierarchical approach helps comparing networks represented at different scales. It provides global statistics but also step-by-step maps that helps characterizing the spatial distribution of network delineation errors.
منابع مشابه
Corefrence resolution with deep learning in the Persian Labnguage
Coreference resolution is an advanced issue in natural language processing. Nowadays, due to the extension of social networks, TV channels, news agencies, the Internet, etc. in human life, reading all the contents, analyzing them, and finding a relation between them require time and cost. In the present era, text analysis is performed using various natural language processing techniques, one ...
متن کاملContourlet-Based Edge Extraction for Image Registration
Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. In general, the majority of registration methods consist of the following four steps: feature extraction, feature matching, transform modeling, and finally image resampling. As the accuracy of a registration process is highly dependent to the fe...
متن کاملAn Approach to Single Image Automatic Orientation and Point Determination by Using Ortho-images and a Dtm
This paper describes an approach to single image automatic orientation and point determination by using current ortho-images and a DTM, and the experience gained in its implementation. The procedure proposed automatically extracts and matches feature points in evenly distributed patches on aerial images and ortho-images. A large number of image measurements (up to several thousand) are obtained...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملHierarchical Elastic Graph Matching for Hand Gesture Recognition
A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating nodes...
متن کامل